Parallel Asynchronous Modelization and Execution of Cholesky Algorithm using Petri Nets

PDPTA 2013 Parallelization of algorithms with hard data dependency has a need of task synchronization. Synchronous parallel versions are simple to model and program, but inefficient in terms of scalability and processors use rate. The same problem for Asynchronous versions with elemental static task scheduling. Efficient Asynchronous algorithms implement out-of-order execution and are complex to model and execute. In this paper we introduce Petri Nets as a tool for simplifying the modeling and execution of parallel asynchronous versions of this kind of algorithms, while using an efficient dynamic task scheduling implementation. The Cholesky factorization algorithm was used as testbed. Simulations were carried out as a proof of concept, based on real execution times on GPGPU’s, and have shown excellent performances. Keywords—Petri Net Modelization Asynchronous Parallel Execution Dynamic Task Scheduling Cholesky Factorization Algorithm.